Performance of GMSK and Reed-Solomon Code Combinations
نویسندگان
چکیده
This paper examines a coded Gaussian Minimum Shift Keying (GMSK) system which uses Reed-solomon (RS) codes in Additive White Gaussian Noise channels.The performance of GMSK and RS code combinations is compared with the constraint that the transmission bandwidth is constant. The coding gains were obtained using simulations and the best combination of GMSK and RS codes was found. Keywords—GMSK, Reed-Solomon codes, coding gain
منابع مشابه
Performance Analysis of Reed Solomon Code for various Modulation Schemes over AWGN Channel
The main objective of this paper is to analyse the performance of Reed-Solomon code for different digital modulation schemes and with different (n,k) combinations over a Additive White Guassian Noise (AWGN) channel. The simulation model provides error detection and correction using ReedSolomon (RS) Code. The Original message is encoded and decoded using RS Code. MATLAB Simulink model is selecte...
متن کاملAnalysis of Coded and Uncoded Digital Modulation Techniques
In this paper impact of Reed Solomon coding over convolutional coding is analyzed for the different modulation techniques. In this paper communication system model employing GMSK, QPSK, and BPSK modulation techniques are implemented assuming the channel to be AWGN in nature. The simulation results obtained shows that GMSK using Reed Solomon encoding and decoding schemes gives improvement in Bit...
متن کاملA general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملReed-Solomon and Hermitian Code-Based Scheduling Protocols for Wireless Ad Hoc Networks
In this work we investigate and compare bounds on throughput and delay performance of code-based scheduling protocols derived from the codewords of Reed-Solomon and Hermitian codes. It is found that Hermitian codes outperform Reed-Solomon codes in minimum throughput guarantee and delay metrics when the number of nodes is in the order of thousands. The relative minimum distance of a code is iden...
متن کاملImproving the Performance of Nested Lattice Codes Using Concatenation
A fundamental problem in coding theory is the design of an efficient coding scheme that achieves the capacity of the additive white Gaussian (AWGN) channel. The main objective of this short note is to point out that by concatenating a capacity-achieving nested lattice code with a suitable highrate linear code over an appropriate finite field, we can achieve the capacity of the AWGN channel with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 88-A شماره
صفحات -
تاریخ انتشار 2005